Public Key Exchange Using Semidirect Product of (Semi)Groups
نویسندگان
چکیده
In this paper, we describe a brand new key exchange protocol based on a semidirect product of (semi)groups (more specifically, on extension of a (semi)group by automorphisms), and then focus on practical instances of this general idea. Our protocol can be based on any group, in particular on any non-commutative group. One of its special cases is the standard Diffie-Hellman protocol, which is based on a cyclic group. However, when our protocol is used with a non-commutative (semi)group, it acquires several useful features that make it compare favorably to the Diffie-Hellman protocol. Here we also suggest a particular non-commutative semigroup (of matrices) as the platform and show that security of the relevant protocol is based on a quite different assumption compared to that of the standard Diffie-Hellman protocol.
منابع مشابه
Using Semidirect Product of (Semi)groups in Public Key Cryptography
In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This protocol can be based on any group or semigroup, in particular on any non-commutative group. One of its special cases is the standard Diffie-Hellman protocol, ...
متن کاملLinear decomposition attack on public key exchange protocols using semidirect products of (semi)groups
We show that a linear decomposition attack based on the decomposition method introduced by the author in monography [1] and paper [2] works by finding the exchanging keys in the both two main protocols in [3] and [4].
متن کاملCryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
The Anshel-Anshel-Goldfeld-Lemieux (abbreviated AAGL) key agreement protocol [1] is proposed to be used on low-cost platforms which constraint the use of computational resources. The core of the protocol is the concept of an Algebraic Eraser (abbreviated AE) which is claimed to be a suitable primitive for use within lightweight cryptography. The AE primitive is based on a new and ingenious idea...
متن کاملThe Schur–zassenhaus Theorem
When N is a normal subgroup of G, can we reconstruct G from N and G/N? In general, no. For instance, the groups Z/(p2) and Z/(p) × Z/(p) (for prime p) are nonisomorphic, but each has a cyclic subgroup of order p and the quotient by it also has order p. As another example, the nonisomorphic groups Z/(2p) and Dp (for odd prime p) have a normal subgroup that is cyclic of order p, whose quotient is...
متن کاملDiscrete Logarithms in Generalized Jacobians
Déchène has proposed generalized Jacobians as a source of groups for public-key cryptosystems based on the hardness of the Discrete Logarithm Problem (DLP). Her specific proposal gives rise to a group isomorphic to the semidirect product of an elliptic curve and a multiplicative group of a finite field. We explain why her proposal has no advantages over simply taking the direct product of group...
متن کامل